Stopping criteria for ending autonomous, single detector radiological source searches
نویسندگان
چکیده
منابع مشابه
Stopping Criteria for Single-Objective Optimization
In most literature dealing with evolutionary algorithms the stopping criterion consists of reaching a certain number of objective function evaluations (or a number of generations, respectively). A disadvantage is that the number of function evaluations that is necessary for convergence is unknown a priori, so trialand-error methods have to be applied for finding a suitable number. By using othe...
متن کاملStopping Criteria for SVMs
The support vector machine has been shown to be comparable to the state of the art for classification. In certain situations however, the convergence to a global optimum of the optimization problem can be very slow. It is shown that solutions suboptimal in terms of the optimization problem can still have very good performance. By using a heuristic stopping criterion (termed HERMES) these soluti...
متن کاملSearches for SUSY with the ATLAS detector
We present a review of the SUSY search strategies in ATLAS in conjunction with a readiness of the detector systems for first collision data in 2009 fall. Commissioning was performed with the LHC single beams and the cosmic ray data in 2008. The talk covers the analysis strategies based on the large Emiss T plus high pT multi-jets signature in which the number of methods are investigated to extr...
متن کاملStopping Criteria for Mixed Finite Element Problems
Abstract. We study stopping criteria that are suitable in the solution by Krylov space based methods of linear and non linear systems of equations arising from the mixed and the mixed-hybrid finite-element approximation of saddle point problems. Our approach is based on the equivalence between the Babuška and Brezzi conditions of stability which allows us to apply some of the results obtained i...
متن کاملStopping Criteria for Adaptive Finite Element Solvers
We consider a family of practical stopping criteria for linear solvers for adaptive finite element methods for symmetric elliptic problems. A contraction property between two consecutive levels of refinement of the adaptive algorithm is shown when the a family of smallness criteria for the corresponding linear solver residuals are assumed on each level or refinement. More importantly, based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2021
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0253211